McNaughton Games and Extracting Strategies for Concurrent Programs

نویسندگان

Anil Nerode

Jeffrey B. Remmel

Alexander Yakhnis

چکیده

Nerode et al. [ 131 showed that a correct concurrent program can be viewed as a winning strategy in a suitably defined two player game played between the Programmer and the Computer in which the program specification is defined by the rules of the game together with the winning condition. This gives rise to the question as to whether there are useful algorithms to extract (provably) winning strategies in these games, which then yield (provably correct) concurrent programs. Now these games can be described in Rabin’s S2S, the monadic second-order theory of two successors. Decision procedures for the latter show that such algorithms exist. But past available decision methods were too cumbersome to use, even in simple cases. Successively simpler game-based decision procedures for S2S were provided by [5,19,20]. In 1993, based on these papers, McNaughton [8] introduced a class of two player infinite games which are played on a finite graph and have an especially lucid decision procedure for extraction of winning strategies. The games considered in [ 131 can be viewed as a slight variant of Bi.ichi-Landweber games [2]. We give clean algorithms for the equivalence of McNaughton games and Bi.ichi-Landweber games. This allows the McNaughton algorithm to be used to extract (provably) winning strategies, and therefore (verifiably correct) concurrent programs via the Nerode-Yakbnis-Yakhnis paradigm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite-State Strategies in Regular Infinite Games

Abs t rac t . This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller automata and by game graphs (as introduced by McNaughton) is considered, and the construction of winning strategies is described in three stages, covering "guarantee games", "recurrence games", and generM regular ...

متن کامل

From Asynchronous Games to Concurrent Games

Game semantics was introduced in order to capture the dynamic behaviour of proofs and programs. In these semantics, the interaction between a program and its environment is modeled by a series of moves exchanged between two players in a game. Every program thus induces a strategy describing how it reacts when it is provided information by its environment. Traditionally, strategies considered in...

متن کامل

Admissibility in Concurrent Games∗†

In this paper, we study the notion of admissibility for randomised strategies in concurrent games. Intuitively, an admissible strategy is one where the player plays ‘as well as possible’, because there is no other strategy that dominates it, i.e., that wins (almost surely) against a superset of adversarial strategies. We prove that admissible strategies always exist in concurrent games, and we ...

متن کامل

Concurrent Hyland-Ong games

We build a cartesian closed category, called Cho, based on event structures. It allows an interpretation of higher-order stateful concurrent programs that is refined and precise: on the one hand it is conservative with respect to standard Hyland-Ong games when interpreting purely functional programs as innocent strategies, while on the other hand it is much more expressive. The interpretation o...

متن کامل